Lipiec trzech władców – walka o tron Anglii po śmierci Edwarda VI
نویسندگان
چکیده
منابع مشابه
Playing weighted Tron on trees
We consider the weighted version of the Tron game on graphs where two players, Alice and Bob, each build their own path by claiming one vertex at a time, starting with Alice. The vertices carry non-negative weights that sum up to 1 and either player tries to claim a path with larger total weight than the opponent. We show that if the graph is a tree then Alice can always ensure to get at most 1...
متن کاملWalka Wartości O Byt W Przestrzeni the Struggle of the Values for Existence in Space
The article is devoted to the problems of axiology of spaces. The aim of the article is to demonstrate that a physical space is the arena of a certain struggle of values. Their materialisation and realisation in the world of real things result from the human understanding, response and approach towards values. The differences in perception of values determine a great number of spatial decisions...
متن کاملO VI Overlying the Scutum Supershell
We present Far Ultraviolet Spectroscopic Explorer observations of the B0 III star HD 177989 (l = 17.8 o , b = −11.9 o , d = 4.9 kpc). This line of sight passes through the high latitude outflow from the Scutum Supershell (GS 018-04+44), a structure that lies at a kinematic distance of ∼ 3.5 kpc, and spans ∼ 5 o in diameter. The O VI λ1031.93 line is compared with STIS observations of Si IV, C I...
متن کاملDirk Schnelle - Walka Technische Universität Darmstadt
My research interests lie in the area of Collaborative User Interfaces for Smart Spaces. Generally these interfaces are multimodal with a special focus on voice as one the major modalities. For me these interfaces should have a good user experience on the one hand and a good developer experience on the other hand. Dialog systems that are easy to implement most likely rely on a finite state mach...
متن کاملTron, a Combinatorial Game on Abstract Graphs
We study the combinatorial two-player game Tron. We answer the extremal question on general graphs and also consider smaller graph classes. Bodlaender and Kloks conjectured in [2] PSPACEcompleteness. We proof this conjecture.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Universitatis Lodziensis. Folia Historica
سال: 2018
ISSN: 2450-6990,0208-6050
DOI: 10.18778/0208-6050.100.05